Comparing Dispatching Rules in An Open Shop-A Simulation Study
نویسندگان
چکیده
Scheduling problems in an open shop is more complicated than others since jobs do not follow a certain route in the system. This study uses computer simulation to compare the performance of different dispatching rules in an open shop. We find that the choice of the best dispatching rule is affected by the utilization factor, due-date factors, and the process time distribution at each station. In general, the best dispatching rule for an open shop is different from that of job shop with the same system configurations. Finally, operation due-date based rules perform better than job due-date based rules.
منابع مشابه
Learning Dispatching Rules for Scheduling: A Synergistic View Comprising Decision Trees, Tabu Search and Simulation
A promising approach for an effective shop scheduling that synergizes the benefits of the combinatorial optimization, supervised learning and discrete-event simulation is presented. Though dispatching rules are in widely used by shop scheduling practitioners, only ordinary performance rules are known; hence, dynamic generation of dispatching rules is desired to make them more effective in chang...
متن کاملNew Dispatching Rules for Scheduling in a Job Shop - an Experimental Study
We present two new dispatching rules for scheduling in a job shop. These rules combine the process-time and work-content in the queue for the next operation on a job, by making use of additive and alternative approaches. An extensive and rigorous simulation study has been carried out to evaluate the performance of the proposed dispatching rules against those by the SPT rule, the WINQ rule, a ra...
متن کاملClassification Rules for the Job Shop Scheduling Problem with Machine Breakdowns
This paper addresses the job shop scheduling problem in the presence of machine breakdowns. In this work, we propose to exploit the advantages of data mining techniques to resolve the problem. We proposed an approach to discover a set of classification rules by using historic scheduling data. Intelligent decisions are then made in real time based on this constructed rules to assign the correspo...
متن کاملA neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment
A hybrid flow shop (HFS) is a generalized flow shop with multiple machines in some stages. HFS is fairly common in flexible manufacturing and in process industry. Because manufacturing systems often operate in a stochastic and dynamic environment, dynamic hybrid flow shop scheduling is frequently encountered in practice. This paper proposes a neural network model and algorithm to solve the dyna...
متن کاملPerformance analysis of dispatching rules in a stochastic dynamic job shop manufacturing system with sequence-dependent setup times: Simulation approach
Stochastic dynamic job shop scheduling problem with consideration of sequence-dependent setup times are among the most difficult classes of scheduling problems. This paper assesses the performance of nine dispatching rules in such shop from makespan, mean flow time, maximum flow time, mean tardiness, maximum tardiness, number of tardy jobs, total setups and mean setup time performance measures ...
متن کامل